#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL col[maxn];
LL dp[maxn][2];
vector<LL>g[maxn];
const LL mod=1e9+7;
void dfs(LL u,LL fa){
     for(LL i=0;i<g[u].size();i++){
         LL v=g[u][i];
         if(v==fa) continue;
         dfs(v,u);
         dp[u][1]=(dp[u][1]%mod*dp[v][0]%mod+dp[u][1]%mod*dp[v][1]%mod+dp[u][0]%mod*dp[v][1]%mod)%mod;
         dp[u][0]=(dp[u][0]%mod*dp[v][0]%mod+dp[u][0]*dp[v][1]%mod)%mod;
     }
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   for(LL i=1;i<n;i++){
       LL x;cin>>x;
       g[x].push_back(i);
   }
   for(LL i=0;i<n;i++){
       cin>>col[i];dp[i][col[i]]=1;
   }
   dfs(0,-1);
   cout<<dp[0][1]<<"\n";
   return 0;
}
